Geometric constraint satisfaction using optimization methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Priority-Based Geometric Constraint Satisfaction

A well-constrained geometric system seldom occurs in practice, especially at the sketchbased initial conceptual design stage. Usually, it is either underor overconstrained because design is a progressive process and it is difficult for a designer to specify all involved constraints in a consistent way. This paper presents a priority-based graphreduction solution, in which each constraint is ass...

متن کامل

Interactive sketch interpretation using arc-labeling and geometric constraint satisfaction

T h i s p a p e r d e s c r i b e s t h e a l g o r i t h m s used by V i k i n g , a sol id m o d e l i n g s y s t e m w h o s e u se r i n t e r f ace is b a s e d o n i n t e r a c t i v e s k e t c h i n t e r p r e t a t i o n . Penc i l a n d p a p e r s k e t c h e s a r e w ide ly u s e d ea r ly in t h e des ign p roces s . V i k i n g ' s u se r in t e r f ace l e t s t h e u s e r c...

متن کامل

Constraint Satisfaction as Global Optimization

We present a optimization formulation for discrete binary CSP, based on the construction of a continuous function A(P) whose global maximum represents the best possible solution for that problem. By the best possible solution we mean either (i) a solution of the problem, if it is solvable, or (ii) a partial solution violating a minimal number of constraints, if the problem is unsolvable. This a...

متن کامل

Assembly modelling by geometric constraint satisfaction

A new approach for representing and reasoning about assemblies of mechanical parts has been developed. The approach combines a formalism for representing relationships among features with a new method for geometric constraint satisfaction. The method employs symbolic reasoning about the geometric structure of parts to solve spatial constraints between the parts, in contrast to other approaches ...

متن کامل

Using Branch-and-Bound with Constraint Satisfaction in Optimization Problems

Optimization Problems Stephen Beale Computing Research Laboratory Box 30001 New Mexico State University Las Cruces, New Mexico 88003 [email protected] Abstract This work1 integrates three related AI search techniques { constraint satisfaction, branch-and-bound and solution synthesis { and applies the result to constraint satisfaction problems for which optimal answers are required. This method ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer-Aided Design

سال: 1999

ISSN: 0010-4485

DOI: 10.1016/s0010-4485(99)00074-3